Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Fast multi-objective hybrid evolutionary algorithm for flow shop scheduling problem
ZHANG Wenqiang, LU Jiaming, ZHANG Hongmei
Journal of Computer Applications    2016, 36 (4): 1015-1021.   DOI: 10.11772/j.issn.1001-9081.2016.04.1015
Abstract461)      PDF (974KB)(565)       Save
A fast multi-objective hybrid evolutionary algorithm was proposed for solving bi-criteria Flow shop Scheduling Problem (FSP) with the objectives of minimizing makespan and total flow time. The sampling strategy of the Vector Evaluated Genetic Algorithm (VEGA) and a new sampling strategy according to the Pareto dominating and dominated relationship-based fitness function were integrated with the proposed algorithm. The new sampling strategy made up the shortage of the sampling strategy of VEGA. VEGA was good at searching the edge region of the Pareto front, but it neglected the central area of the Pareto front, while the new sampling strategy preferred the center region of the Pareto front. The fusion of these two mechanisms ensured that the hybrid algorithm can converge to the Pareto front quickly and smoothly. Moreover, the algorithm efficiency was improved greatly without calculating the distance. Simulation experiments on Taillard benchmark sets show that, compared with Non-dominated Sorting Genetic Algorithm-Ⅱ (NSGA-Ⅱ) and Strength Pareto Evolutionary Algorithm 2 (SPEA2), the fast multi-objective hybrid evolutionary algorithm is improved in the performance of convergence and distribution, and the efficiency of the algorithm has been improved. The proposed algorithm can be better at solving the bi-criteria flow shop scheduling problem.
Reference | Related Articles | Metrics